Load Shedding

1. Aberer K., Datta A., Hauswirth M., and Schmidt R. Indexing data-oriented overlay networks. In Int. Conf. on Very Large Data Bases (VLDB 2005). (More details at http://www.pgrid.org) 2. Aberer K., Datta A., and Hauswirth M. Multifaceted simultaneous load balancing in DHT-based P2P systems: a new game with old balls and bins. In Self-Properties in Complex Information Systems, Springer, Berlin, 2005. 3. Bharambe A., Agrawal M., and Seshan S. Mercury: supporting scalable multi-attribute range queries. In Symp. on Communications Architectures and Protocols (SIGCOMM 2004). 4. Brighten Godfrey P. and Stoica I. Heterogeneity and Load Balance in Distributed Hash Tables, Infocom 2005. 5. Byers J., Considine J., and Mitzenmacher M. Simple load balancing for distributed hash tables. In Second Int. Workshop on Peer-to-Peer Systems (IPTPS 2003). 6. Dabek F., Kaashoek F., Karger D., Morris R., and Stoica I. Wide-area cooperative storage with CFS. In ACM Symp. on Operating Systems Principles (SOSP 2001). (More details at http://pdos.csail.mit.edu/chord) 7. Datta A., Schmidt R., and Aberer K. Query-load balancing in structured overlays. IEEE Int. Symp. on Cluster Computing and the Grid (CCGrid 2007). 8. Ganesan P., Bawa M., and Garcia-Molina H. Online balancing of range-partitioned data with applications to peerto-peer systems. In Int. Conf. on Very Large Data Bases (VLDB 2004). 9. Girdzijauskas S., Datta A., and Aberer K. Oscar: Smallworld overlay for realistic key distributions. In the International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P 2006). 10. Godfrey B., Lakshminarayanan K., Surana S., Karp R., and Stoica I. Load Balancing in Dynamic Structured P2P Systems, Infocom 2004. 11. Karger D., Lehman E., Leighton T., Levine M., Lewin D., and Panigrahy R. Consistent hashing and random trees: tools for relieving hot spots on the World Wide Web. ACM Symposium on Theory of Computing (STOC 1997). 12. Kleinberg J. The small-world phenomenon: an algorithmic perspective. In ACM Symp. on Theory of Computing (STOC 2000). 13. Mitzenmacher M. The power of two choices in randomized load balancing. IEEE Trans. Parall. Distrib. Syst., 12 (10):1094–1104, 2001. 14. Raab M. and Steger A. Balls into bins – a simple and tight analysis. In International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM’98). 15. Steinmetz R. and Wehrle K. (eds.). Peer-to-Peer Systems and Applications. Springer Lecture Notes in Computer Science, vol. 3485, 2005. Chapters 9 & 10. (Book website http://www. peer-to-peer.info/) Load Shedding